Step of Proof: biject_wf
12,41
postcript
pdf
Inference at
*
I
of proof for Lemma
biject
wf
:
A
,
B
:Type,
f
:(
A
B
). Bij(
A
;
B
;
f
)
latex
by ((Unfold `biject` 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
.
Definitions
P
&
Q
,
Bij(
A
;
B
;
f
)
,
,
t
T
,
x
:
A
.
B
(
x
)
Lemmas
surject
wf
,
inject
wf
origin